Embedding a Formal Notation: Experiences of Automating the Embedding of Z in the Higher Order Logics of Pvs and Hol Embedding a Formal Notation: Experiences of Automating the Embedding of Z in the Higher Order Logics of Pvs and Hol
نویسندگان
چکیده
In this paper, we consider the problem of embedding formal notations. In particular, we describe our experiences of automating the embedding of Z speciications into the notations of the PVS and HOL theorem provers. This paper is motivated by our experiences of constructing a prototype tool for embedding formal notations and its use in automating an embedding of Z and AMN into the notations of PVS and HOL. This work has been funded by the EPSRC (grant GR/K83014).
منابع مشابه
A Prototype Generic Tool Supporting the Embedding of Formal Notations
In this paper, we describe the design and implementation of a prototype tool designed to support the embedding of one formal notation within another. The tool is designed primarily to support the automatic embedding of specification notations such as Z or AMN into the notations of generic theorem provers such as HOL or PVS. It is written in Java , which enables novel features such as dynamic ex...
متن کاملA Survey on Embedding Programming Logics in a Theorem Prover
Theorem provers were also called ’proof checkers’ because that is what they were in the beginning. They have grown powerful, however, capable in many cases to automatically produce complicated proofs. In particular, higher order logic based theorem provers such as HOL and PVS became popular because the logic is well known and very expressive. They are generally considered to be potential platfo...
متن کاملA shallow embedding of Z in HOL
A simple ‘shallow’ semantic embedding of the Z notation into the higher order logic, as supported by the HOL theorem proving system, is presented. Z is is typically used for human-readable formal specification whereas HOL is used for machine-checked verification. The paper is intended to show how a tool such as HOL can be used to provide mechanical support for Z, including mechanization of proo...
متن کاملZ and HOL
A simple `shallow' semantic embedding of the Z notation into the HOL logic is described. The Z notation is based on set theory and rst order predicate logic and is typically used for human-readable formal speci cation. The HOL theorem proving system supports higher order logic and is used for machine-checked veri cation. A well-known case study is used as a running example. The presentation is ...
متن کامل1 Embedding of First-Order Nominal Logic into Higher-Order Logic
Nominal logic, also referred to as hybrid logic, is a general term for extensions of ordinary modal logics that introduce a new sort of atomic formulae, the socalled nominals. These nominals are only true at one possible world and false at every other world. The shifter, denoted @, can be used to evaluate the truth of a formula φ at a given world corresponding to nominal i as in @iφ. The simple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998